Weight- and Layout-Optimized Sparse Arrays
نویسندگان
چکیده
Theory for random arrays predicts a mean sidelobe level given by the inverse of the number of elements. In this paper two optimization methods for thinned arrays are given: one is for optimizing the weights of each element, and the other one optimizes both the layout and the weights. The weight optimization algorithm is based on linear programming and minimizes the peak sidelobe level for a given beamwidth. It is used to investigate the conditions for finding thinned arrays with peak sidelobe level at or below the inverse of the number of elements. With optimization of the weights of a randomly thinned array it is possible to come quite close and even below this value, especially for 1D arrays. Even for 2D sparse arrays a large reduction in peak sidelobe level is achieved. Even better solutions are found when the thinning pattern is optimized also. This requires an algorithm that uses mixed integer linear programming. In this case solutions with lower peak sidelobe level than the inverse number of elements can be found both in the 1D and the 2D cases.
منابع مشابه
Experience with sparse arrays at the University of Oslo
This paper gives an overview over work on layout and weight optimization of sparse 1D and 2D arrays which has been done over the last decade. The optimization methods have been linear programming, genetic methods and simulated annealing. The latter is our preferred method. The paper shows examples of optimized arrays on Cartesian and nonCartesian grids such as polar and hex. Non-planar arrays (...
متن کاملSparse 2 D Arrays for Real - Time 3 D Ultrasound
Existing 3D ultrasound systems are based on mechanically moving 1D arrays for data collection and post-processing of data to achieve 3D images. To be able to both collect and process 3D data in real-time, a scaling of the ultrasound system from 1D to 2D arrays is necessary. A typical 2D-system uses 1D arrays with about 100 receive and transmit channels. Scaling of this system to get a 3Dsystem ...
متن کاملIntegrating dense and sparse data partitioning
Layout methods for dense and sparse data are often seen as two separate problems with its own particular techniques. However, they are based on the same basic concepts. This paper studies how to integrate automatic data-layout and partition techniques for both dense and sparse data structures. In particular, we show how to include support for sparse matrices or graphs in Hitmap, a library for h...
متن کامل3D Optimization of Gear Train Layout Using Particle Swarm Optimization Algorithm
Optimization of the volume/weight in the gear train is of great importance for industries and researchers. In this paper, using the particle swarm optimization algorithm, a general gear train is optimized. The main idea is to optimize the volume/weight of the gearbox in 3 directions. To this end, the optimization process based on the PSO algorithm occurs along the height, length, and width of t...
متن کاملSidelobe Minimisation in Integer-Positioned Sparse Antenna Arrays
– Modern array signal processing applications place great demands on the underlying antenna array geometry to deliver high performance. This paper discusses a computational solution to an integer multicriteria optimisation (MO) problem that arises in a certain class of nonuniform linear array (NLA) design. “Fully augmentable” arrays have a full and complete set of covariance lag differences; wi...
متن کامل